Collaborative Lot-Sizing problem for an Industrial Symbiosis
نویسندگان
چکیده
منابع مشابه
Lot-sizing Problem with Several Production Centers
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item production planning in several production centers that do not present capacity constraints. Demand can be met with backlogging or not. This problem results from simplifying practical problems, such as the material requirement planning (MRP) system and also lot-sizing problems with multiple items...
متن کاملThe economic lot-sizing problem with an emission constraint
We consider a generalisation of the lot-sizing problem that includes an emission constraint. Besides the usual financial costs, there are emissions associated with production, keeping inventory and setting up the production process. Because the constraint on the emissions can be seen as a constraint on an alternative cost function, there is also a clear link with bi-objective optimisation. We s...
متن کاملA stochastic approach for the Lot Sizing problem
In this paper we extend the generalized surrogate optimization approaches and the stochastic comparison so as to tackle the lot-sizing problem in manufacturing system. In practice, with the surrogate methodology, the lot sizes are continuously adjusted on-line by the gradient-based approaches. The lot sizing determines the number of parts batched together for production. We utilize the queueing...
متن کاملRelaxations for Two - Level Multi - Item Lot - Sizing Problem
We consider several variants of the two-level lot-sizing problem with one item at the upper level facing dependent demand, and multiple items or clients at the lower level, facing independent demands. We first show that under a natural cost assumption, it is sufficient to optimize over a stock-dominant relaxation. We further study the polyhedral structure of a strong relaxation of this problem ...
متن کاملTabu Search for a Discrete Lot Sizing and Scheduling Problem
In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.11.382